THE DECIDABILITY OF THE DOL-DTOL EQUIVALENCE PROBLEMRUOHONEN K.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 42-52; BIBL. 18 REF.Article

Recurrent words and simultaneous growth in TOL systemsLANGE, K.-J; WELZL, E.Theoretical computer science. 1985, Vol 35, Num 1, pp 1-15, issn 0304-3975Article

ON INFINITE WORDS OBTAINED BY ITERATING MORPHISMSCULIK K II; SALOMAA A.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 29-38; BIBL. 12 REF.Article

ON COMMUTATIVE DTOL SYSTEMSKARHUMAKI J.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 2; PP. 207-220; BIBL. 11 REF.Article

CUT POINT LANGUAGES OF MARKOV DTOL SYSTEMSJUERGENSEN H; MATTHEWS DE; WOOD D et al.1981; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1981; VOL. 10; NO 5; PP. 331-340; BIBL. 6 REF.Article

POWER FROM POWER SERIESSALOMA A.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 170-181; BIBL. 13 REF.Conference Paper